Seismic gyrotropy as a result of rock-microstructure dissymmetry

Seismic investigations show that rocks exhibit not only anisotropic properties but also gyrotropic ones. Recently, the phenomenological theory has been developed to describe the phenomenon ‘seismic gyrotropy'. The paper gives a possible explanation of the gyrotropic properties of rocks on a microlevel. A gyrotropic model of grainy rock with dissymetry in its microstructure is presented. The model is built on a principle ‘azimuthal turn plus translation'. The mathematical and physical formulations of the problem are discussed. An algorithm is constructed to find the displacements, their first and second derivatives with respect to spatial coordinates as well as stresses inside a grain, an element of the model. Mathematical modelling of elastic-wave propagation in the model considered enabled to demonstrate that the model possesses gyrotropic properties, i.e., it rotates on a polarization vector. Gyration constants are determined.     

无正则性条件下的一个信赖域方法的全局收敛性

1.引 言考虑下列等式约束最优化问题:min f(x)x∈Rn (1.1)s.t.C(x)=0其中f:Rn→R,C（x）=（c1（x）,C2（x）,…,Cm（x））T,Ci:Rn→R,（i=1,…,m）.我们假设f（x）,Ci（x）（i=1,2,…,m）是连续可微函数.令g（x）=　f（x）,A（x）=　C（x）T.为了方便,我们通常用 Ck,fk,gk,Ak分别表示 C（xk）,f（xk）,g（xk）A（xk）. SQP方法是一迭代方法.在 xk点,通过解下列子问题来得到搜索方向 dk     

限制卖空及带交易费用的证券组合的三参数模型

本文在 (Simaan(1993) )组合选择的三参数模型的框架下 ,考虑了交易费用 ,限制卖空 ,提出了新的风险证券投资组合模型 ,并给出了风险投资最优比例的算法 .     

Minimizing the number of workers in a paced mixed-model assembly line

We study a problem of minimizing the maximum number of identical workers over all cycles of a paced assembly line comprised of m stations and executing n parts of k types. There are lower and upper bounds on the workforce requirements and the cycle time constraints. We show that this problem is equivalent to the same problem without the cycle time constraints and with fixed workforce requirements. We prove that the problem is NP-hard in the strong sense if $m=4$ and the workforce requirements are station independent, and present an Integer Linear Programming model, an enumeration algorithm and a dynamic programming algorithm. Polynomial in k and polynomial in n algorithms for special cases with two part types or two stations are also given. Relations to the Bottleneck Traveling Salesman Problem and its generalizations are discussed.     

A NEW ALGORITHM FOR BALL-CONSTRAINED QUADRATIC MINIMIZATION PROBLEMS

A new algorithm for the ball-constrained quadratic minimization problem min ,with a symmetric semi-positive definite matrix H and nonzero vector 6 , is presented:zk+1 > 0, k= 0,1,2,…,where z0 > 0 , and S, = Si(zk) = bT(H + zkl)-ib, i = 2,3,4.We proved that, the iterative sequence converges monotonically to the unique minimum norm minimizer x:And the convergence rate of is 3,2, and 4/3 according to z > 0, lim S2(z) < 1 and lim S2(z)= 1 respectively.     

数据变换参数的渐近置信域的曲率表示

该文首次用几何方法研究回归模型中数据变换参数及其子集参数的渐近置信域问题．由于文中讨论的是一般的数据变换多参数的渐近置信域的曲率表示，从而有关结论适用于各种数据变换如著名的Box-Cox变换、带有漂移参数的幂变换等变换中变换参数的渐近置信域的曲率表示．     

Geometric applications of posets

We show the power of posets in computational geometry by solving several problems posed on a set S of n points in the plane: (1) find the n − k − 1 rectilinear farthest neighbors (or, equivalently, k nearest neighbors) to every point of S (extendable to higher dimensions), (2) enumerate the k largest (smallest) rectilinear distances in decreasing (increasing) order among the points of S, (3) given a distance δ > 0, report all the pairs of points that belong to S and are of rectilinear distance δ or more (less), covering k ≥ n/2 points of S by rectilinear (4) and circular (5) concentric rings, and (6) given a number k ≥ n/2 decide whether a query rectangle contains k points or less.     

Extension of the generalized multipole technique to anisotropic medias

This paper presents an extension of the generalized multipole technique (GMT) for 2D anisotropic scatterers. New expansions similar to the Bessel multipole expansion are derived for arbitrary anisotropic media. Numerical simulations prove the accuracy and the rapid convergence of these expansions. As the results obtained are extremely accurate, this technique is most helpful for the evaluation of reference solutions and for the understanding of the physical interaction of light with arbitrary anisotropic media.     

无约束最优化锥模型拟牛顿信赖域方法的收敛性(英)

本文研究无约束最优化雄模型拟牛顿信赖域方法的全局收敛性．文章给出了确保这类方法全局收敛的条件．文章还证明了，当用拆线法来求这类算法中锥模型信赖域子问题的近似解时，确保全局收敛的条件得到满足     

A combinatorial approach to cartograms

A homeomorphism from ² to itself distorts metric quantities, such as distance and area. We describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so their area distributions reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results produced by the preliminary implementation of the method are included.